Immanantal Polynomials of Laplacian Matrix of Trees
نویسندگان
چکیده
The immanant d () associated with the irreducible character of the symmetric group S n , indexed by the partition of n, acting on an nn matrix A = a ij ] is deened by d (A) = X 2Sn () n Y i=1 a ii(i) : For a tree T on n vertices, let L(T) denote its Laplacian matrix. Let x be an indeterminate variable and I be the n n identity matrix. The immanantal polynomial of T corresponding to d is deened as d (xI ? L(T)) = n X k=0 (?1) k c ;k(T) x n?k : The coeecients c ;k (T) admit various algebraic and topological interpretations for the tree T. We study the properties of c ;k (T) as well as upper and lower bounds on c ;k (T) and in particular show that c ;k (S(n)) c ;k (T) c ;k (P (n)) for all partitions and 0 k n, where S(n) and P(n) denote the star and the path on n vertices respectively. This answers some questions posed in 16] in the aarmative. We study the properties of c ;k (T) in more detail when is restricted to the family of hook immanants.
منابع مشابه
Immanantal polynomials and the GTS poset on Trees
Csikvári in [10] defined a poset on the set of unlabelled trees with n vertices that we denote in this paper as GTSn. Among other results, he showed that going up on GTSn has the following effect: the coefficients of the characteristic polynomial of the Laplacian LT of T decrease in absolute value. In this paper, we prove the following more general result involving the q-Laplacian matrix of tre...
متن کاملSeidel Signless Laplacian Energy of Graphs
Let $S(G)$ be the Seidel matrix of a graph $G$ of order $n$ and let $D_S(G)=diag(n-1-2d_1, n-1-2d_2,ldots, n-1-2d_n)$ be the diagonal matrix with $d_i$ denoting the degree of a vertex $v_i$ in $G$. The Seidel Laplacian matrix of $G$ is defined as $SL(G)=D_S(G)-S(G)$ and the Seidel signless Laplacian matrix as $SL^+(G)=D_S(G)+S(G)$. The Seidel signless Laplacian energy $E_{SL^+...
متن کاملTwo Classes of Integral Regular Graphs
A graph G is called integral or Laplacian integral if all the eigenvalues of the adjacency matrix A(G) or the Laplacian matrix Lap(G) = D(G)−A(G) of G are integers, where D(G) denote the diagonal matrix of the vertex degrees of G. Let Kn,n+1 ≡ Kn+1,n and K1,p[(p−1)Kp] denote the (n+1)-regular graph with 4n+2 vertices and the p-regular graph with p2 + 1 vertices, respectively. In this paper, we ...
متن کاملEigenvalues of normalized Laplacian matrices of fractal trees and dendrimers: analytical results and applications.
The eigenvalues of the normalized Laplacian matrix of a network play an important role in its structural and dynamical aspects associated with the network. In this paper, we study the spectra and their applications of normalized Laplacian matrices of a family of fractal trees and dendrimers modeled by Cayley trees, both of which are built in an iterative way. For the fractal trees, we apply the...
متن کاملSome results on the energy of the minimum dominating distance signless Laplacian matrix assigned to graphs
Let G be a simple connected graph. The transmission of any vertex v of a graph G is defined as the sum of distances of a vertex v from all other vertices in a graph G. Then the distance signless Laplacian matrix of G is defined as D^{Q}(G)=D(G)+Tr(G), where D(G) denotes the distance matrix of graphs and Tr(G) is the diagonal matrix of vertex transmissions of G. For a given minimum dominating se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007